'''def f(a, b, c, d, x):#1
    return a * x ** 3 + b * x ** 2 + c * x + d

def root_of(a, b, c, d): 
    qujian = [(0, 3), (3, 7), (7, 10)]
    precision = 0.0001  # 精度
    gen = []
    for left, right in qujian:
        while right - left >= precision:
            mid = (right + left) / 2
            if f(a, b, c, d, mid) == 0: #刚好
                gen.append("%.4f" % mid)
                break
            elif f(a, b, c, d, left) * f(a, b, c, d, mid) < 0:
                right = mid
            elif f(a, b, c, d, mid) * f(a, b, c, d, right) < 0:
                left = mid
        else:
            gen.append("%.4f" % ((right + left) / 2))
    return gen

if __name__ == '__main__':
    a, b, c, d =1, -14, 56, -64
    print(root_of(a, b, c, d))'''

'''def zb(standard, talls):#2
    talls.sort()
    left, right = 0, len(talls)
    while left < right:
        mid = (left + right) // 2
        if talls[mid] < standard:
            left = mid + 1
        else:
            right = mid
    return talls[left:]

if __name__ == '__main__':
    standard = 165
    talls = [165, 164, 190, 146, 153, 183, 171]
print(zb(standard, talls)) '''

'''def jianshi(m, n):#4
    if m > n:
        return 0
    return m + jianshi(m + 1, n)
if __name__ == '__main__':
    m, n = 4, 7
    ans = jianshi(m, n)
    print(ans)'''

'''def gongc(d):#5
    if d == 10:
        return 1
    return 2 * (gongc(d + 1) + 1) 
n = gongc(0)
print(n)
'''

'''def yu(mp):#7...
    row = len(mp)
    colom = len(mp[0])
    visit = 
    def dfs_yu(x, y):
        if x < 0 or y < 0 or x > row - 1 or y > colum - 1:
            return True
        if visit[x][y] is True:
            return False
        visit[x][y] = True
        if mp[x][y] == 1:
            '''


'''def wt(mp):#8...
    row = len(mp)#行数
    colum = len(mp[0])#列数
    visit = 
    def dfs_wt(x, y):
        if x < 0 or y < 0 or x > row - 1 or y > colum - 1:
            return True
        if visit[x][y] is True:
            return False
        visit[x][y] = True
    count = 0
    for i in range(row):
        for j in range(colum):
            if mp[i][j] == 1 and not visit[i][j]:
                dfs_wt(i, j)
                count += 1
    return count
mp = [
    [1, 1, 1, 1, 0],
    [0, 0, 1, 0, 1],
    [0, 0, 0, 0, 0],
    [1, 1, 1, 0, 0],
    [0, 0, 0, 1, 1]
 ]
print(wt(mp))'''

